1 Redundant Addition with Threshold Logic
نویسندگان
چکیده
In this paper we investigate threshold based networks performing 2 1 addition using redundant binary operand representations. In particular we concern with establishing the networks with the smallest network depth assuming small weight and fan-in values. First we propose a depth-4 implementation and we show that the 2 1 addition can be computed by a threshold network with the size in the order of O(n) and with O(1) weight and fan-in values. Consequently, we prove that the network depth can be reduced to 2 and yet maintain the O(n) size and O(1) weight and fan-in asymptotic complexities.
منابع مشابه
Signed Digit Addition and Related Operations with Threshold Logic
ÐAssuming signed digit number representations, we investigate the implementation of some addition related operations assuming linear threshold networks. We measure the depth and size of the networks in terms of linear threshold gates. We show first that a depth-2 network with O n size, weight, and fan-in complexities can perform signed digit symmetric functions. Consequently, assuming radix-2 ...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملASIC Design of Butterfly Unit Based on Non-Redundant and Redundant Algorithm
Fast Fourier Transform (FFT) processors employed with pipeline architecture consist of series of Processing Elements (PE) or Butterfly Units (BU). BU or PE of FFT performs multiplication and addition on complex numbers. This paper proposes a single BU to compute radix-2, 8 point FFT in the time domain as well as frequency domain by replacing a series of PEs. This BU comprises of fused floating ...
متن کاملDesign and Synthesis of High Speed Low Power Signed Digit Adders
Signed digit (SD) number systems provide the possibility of constant-time addition, where inter-digit carry propagation is eliminated. Such carry-free addition is primarily a three-step process; adding the equally weighted SDs to form the primary sum digits, decomposing the latter to interim sum digits and transfer digits, which commonly belong to {–1, 0, 1}, and finally adding the tra...
متن کاملFully redundant decimal addition and subtraction using stored-unibit encoding
Decimal computer arithmetic is experiencing a revived popularity, and there is quest for highperformance decimal hardware units. Successful experiences on binary computer arithmetic may find grounds in decimal arithmetic. For example, the traditional fully redundant (i.e., the result and both of the operands are represented in a redundant format) and semi-redundant (i.e., the result and only on...
متن کامل